High-order linear multistep methods with general monotonicity and boundedness properties
نویسندگان
چکیده
We consider linear multistep methods that possess general monotonicity and boundedness properties. Strict monotonicity, in terms of arbitrary starting values for the multistep schemes, is only valid for a small class of methods, under very stringent step size restrictions. This makes them uncompetitive with the strong-stability-preserving (SSP) Runge– Kutta methods. By relaxing these strict monotonicity requirements a larger class of methods can be considered, including many methods of practical interest. In this paper we construct linear multistep methods of high-order (up to six) that possess relaxed monotonicity or boundedness properties with optimal step size conditions. Numerical experiments show that the new schemes perform much better than the classical monotonicity-preserving multistep schemes. Moreover there is a substantial gain in efficiency compared to recently constructed SSP Runge–Kutta (SSPRK) methods. 2005 Elsevier Inc. All rights reserved. MSC: 65L06; 65M06; 65M20; 35L65; 76M20
منابع مشابه
On monotonicity and boundedness properties of linear multistep methods
In this paper an analysis is provided of nonlinear monotonicity and boundedness properties for linear multistep methods. Instead of strict monotonicity for arbitrary starting values we shall focus on generalized monotonicity or boundedness with Runge-Kutta starting procedures. This allows many multistep methods of practical interest to be included in the theory. In a related manner, we also con...
متن کاملIMEX extensions of linear multistep methods with general monotonicity and boundedness properties
For solving hyperbolic systems with stiff sources or relaxation terms, time stepping methods should combine favorable monotonicity properties for shocks and steep solution gradients with good stability properties for stiff terms. In this paper we consider implicit–explicit (IMEX) multistep methods. Suitable methods will be constructed, based on explicit methods with general monotonicity and bou...
متن کاملStepsize Restrictions for Boundedness and Monotonicity of Multistep Methods
In this paper nonlinear monotonicity and boundedness properties are analyzed for linear multistep methods. We focus on methods which satisfy a weaker boundedness condition than strict monotonicity for arbitrary starting values. In this way, many linear multistep methods of practical interest are included in the theory. Moreover, it will be shown that for such methods monotonicity can still be v...
متن کاملComputation of optimal monotonicity preserving general linear methods
Monotonicity preserving numerical methods for ordinary differential equations prevent the growth of propagated errors and preserve convex boundedness properties of the solution. We formulate the problem of finding optimal monotonicity preserving general linear methods for linear autonomous equations, and propose an efficient algorithm for its solution. This algorithm reliably finds optimal meth...
متن کاملMonotonicity-Preserving Linear Multistep Methods
In this paper we provide an analysis of monotonicity properties for linear multistep methods. These monotonicity properties include positivity and the diminishing of total variation. We also pay particular attention to related boundedness properties such as the total variation bounded (TVB) property. In the analysis the multistep methods are considered in combination with suitable starting proc...
متن کامل